Factoring With Two Large Primes
نویسندگان
چکیده
We describe a modification to the well-known large prime variant of the multiple polynomial quadratic sieve factoring algorithm. In practice this leads to a speed-up factor of 2 to 2.5. We discuss several implementation-related aspects, and we include some examples. Our new variation is also of practical importance for the number field sieve factoring algorithm. 1. Factoring with two large primes Let « > 1 be an odd integer which is not a prime power. For each random integer x satisfying
منابع مشابه
Are 'Strong' Primes Needed for RSA
We review the arguments in favor of using so called strong primes in the RSA public key cryptosystem There are two types of such arguments those that say that strong primes are needed to protect against factoring attacks and those that say that strong primes are needed to protect against cycling attacks based on repeated encryption We argue that contrary to common belief it is unnecessary to us...
متن کاملImplementing the Hypercube Quadriatic Sieve with Two Large Primes
This paper deals with variations of the Quadratic Sieve integer factoring algorithm. We describe what we believe is the rst implementation of the Hypercube Multiple Polynomial Quadratic Sieve with two large primes, We have used this program to factor many integers with up to 116 digits. Our program appears to be many times faster than the (non-hypercube) Multiple Polynomial Quadratic Sieve with...
متن کاملNFS with Four Large Primes: An Explosive Experiment
The purpose of this paper is to report the unexpected results that we obtained while experimenting with the multi-large prime variation of the general number field sieve integer factoring algorithm (NFS, cf. [8]). For traditional factoring algorithms that make use of at most two large primes, the completion time can quite accurately be predicted by extrapolating an almost quartic and entirely ‘...
متن کاملDe Factorisatione Numerorum I : In Pursuit of the Erymanthian Boar
Abstract. We introduce a new deterministic factoring algorithm, which could be described in the fashionable term of “factoring with hints”: we show that, given the knowledge of the factorisations of O(N) terms following N = pq product of two large primes, we can recover deterministically p and q in O(N) bit operations. Although this is slower than the current best factoring algorithms, this met...
متن کاملA heuristic search based factoring tool
Factoring is believed to be a diflcult task. Although factoring is of interest in its own right, the security of RSA cryptography, among other cryptographic systems, is dependent on the diflculty of factoring the product of two large primes. We show how to cast the problem of factoring integers as a state-based search to which the techniques of AI may be applied. Using small primes as operators...
متن کامل